Finding a Longest Path in a Complete Multipartite Digraph
نویسندگان
چکیده
منابع مشابه
Finding a Longest Path in a Complete Multipartite Digraph
A digraph obtained by replacing each edge of a complete mpartite graph with an arc or a pair of mutually opposite arcs with the same end vertices is called a complete m-partite digraph. We describe an O(n) algorithm for finding a longest path in a complete m-partite (m ≥ 2) digraph with n vertices. The algorithm requires time O(n) in case of testing only the existence of a Hamiltonian path and ...
متن کاملRanking the Vertices of a Complete Multipartite Paired Comparison Digraph
A paired comparison digraph (abbreviated to PCD)D = (V,A) is a weighted digraph in which the sum of the weights of arcs, if any, joining two distinct vertices equals one. A one-to-one mapping α from V onto {1, 2, ..., |V |} is called a ranking ofD. For every ranking α, an arc vu ∈ A is said to be forward if α(v) < α(u), and backward, otherwise. The length of an arc vu is `(vu) = (vw)|α(v)− α(u)...
متن کاملThe Longest Minimum-Weight Path in a Complete Graph
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variables. We show that the longest of these minimum-weight paths has about α logn edges where α ≈ 3.5911 is the unique solution of the equation α logα − α = 1. This answers a question left open by Janson [8].
متن کاملThe ratio of the longest cycle and longest path in semicomplete multipartite digraphs
A digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair of mutually opposite arcs is called a semicomplete n-partite digraph. We call (D)=max16 i6 n{|Vi|} the independence number of the semicomplete n-partite digraph D, where V1; V2; : : : ; Vn are the partite sets of D. Let p and c, respectively, denote the number of vertices in a longest directed path and t...
متن کاملNote on the Path Covering Number of a Semicomplete Multipartite Digraph
A digraph D is called is semicomplete c-partite if its vertex set V (D) can be partitioned into c sets (partite sets) such that for any two vertices x and y in diierent partite sets at least one arc between x and y is in D and there are no arcs between vertices in the same partite set. The path covering number of D is the minimum number of paths in D that are pairwise vertex disjoint and cover ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1993
ISSN: 0895-4801,1095-7146
DOI: 10.1137/0406020